2-pile Nim with a Restricted Number of Move-size Imitations
نویسندگان
چکیده
We study a variation of the combinatorial game of 2-pile Nim. Move as in 2-pile Nim but with the following constraint: Provided the previous player has just removed say x > 0 tokens from the pile with less tokens, the next player may remove x tokens from the pile with more tokens. But for each move, in “a strict sequence of previous player next player moves”, such an imitation takes place, the value of an imitation counter is increased by one unit. As this counter reaches a pre-determined natural number, then by the rules of this game, if the previous player once again removes a positive number of tokens from the pile with less tokens, the next player may not remove this same number of tokens from the pile with more tokens. We show that the winning positions of this game in a sense resemble closely the winning positions of the game of Wythoff Nim more precisely a version of Wythoff Nim with a Muller twist. In fact, we show a slightly more general result in which we have relaxed the notion of what an imitation is.
منابع مشابه
Multivision: An Intractable Impartial Game With a Linear Winning Strategy
Multivision is played by two players who move alternately on a finite number of piles of finitely many tokens. A move consists of selecting a nonempty pile and changing the number of tokens in it. If the change is just any reduction in the number of tokens, we have the well-known game of Nim [1], [2]. In the present case, however, it is also permissible, normally, to increase the size of a pile...
متن کاملPilesize Dynamic One-pile Nim and Beatty’s Theorem
In [4] we proved a generalization of Beatty’s Theorem which we stated came from the Nim value analysis of a game. In this paper we give the Nim value analysis of this game and show its relationship with Beatty’s Theorem. The game is a one-pile counter pickup game for which the maximum number of counters that can be removed on each successive move changes during the play of the game. The move si...
متن کاملDynamic One and Two Pile Nim Games Using Generalized Bases
Several authors have written papers dealing with a class of combinatorial games consisting of one-pile and two-pile counter pickup games for which the maximum number of counters that can be removed on each move changes during the play of the game. See Holshouser [8],[7], and Flanigan [4]. The maximum number of counters that can be removed can depend upon a number of factors including the number...
متن کاملDynamic Single-Pile Nim Using Multiple Bases
In the game G0 two players alternate removing positive numbers of counters from a single pile and the winner is the player who removes the last counter. On the first move of the game, the player moving first can remove a maximum of k counters, k being specified in advance. On each subsequent move, a player can remove a maximum of f(n, t) counters where t was the number of counters removed by hi...
متن کاملWythoff'snim and Fibonacci Representations
Our aim in what follows is to show how Fibonacci representations play a role in determining winning moves for Wythoffs Nim [1, 2] very analogous to the role of binary representations in Bouton's Nim [3 ] . The particulars of these two games can be found in the preceding references, but for the convenience of the reader, we briefly recount the rules of play. In Bouton's Nim (usually referred to ...
متن کامل